Cotranscriptional Kinetic Folding of RNA Secondary Structures Including Pseudoknots
نویسندگان
چکیده
منابع مشابه
Predicting RNA Secondary Structures Including Pseudoknots
RNA secondary structures play a vital role in modern genetics and a lot of time and e ort has been put into their study. It is important to be able to predict them with high accuracy, since methods involving manual analysis are expensive, time-consuming and error-prone. Predictions can also be used to guide experiments to reduce time and money requirements. Several algorithms have been develope...
متن کاملHotKnots: heuristic prediction of RNA secondary structures including pseudoknots.
We present HotKnots, a new heuristic algorithm for the prediction of RNA secondary structures including pseudoknots. Based on the simple idea of iteratively forming stable stems, our algorithm explores many alternative secondary structures, using a free energy minimization algorithm for pseudoknot free secondary structures to identify promising candidate stems. In an empirical evaluation of the...
متن کاملTurboKnot: rapid prediction of conserved RNA secondary structures including pseudoknots
MOTIVATION Many RNA molecules function without being translated into proteins, and function depends on structure. Pseudoknots are motifs in RNA secondary structures that are difficult to predict but are also often functionally important. RESULTS TurboKnot is a new algorithm for predicting the secondary structure, including pseudoknotted pairs, conserved across multiple sequences. TurboKnot fi...
متن کاملCotranscriptional folding kinetics of ribonucleic acid secondary structures.
We develop a systematic helix-based computational method to predict RNA folding kinetics during transcription. In our method, the transcription is modeled as stepwise process, where each step is the transcription of a nucleotide. For each step, the kinetics algorithm predicts the population kinetics, transition pathways, folding intermediates, and the transcriptional folding products. The foldi...
متن کاملFixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is NP-hard, the algorithmic complexity adapts to the complexity of the RNA structures. Due to fixed parameter tractability, we can guarantee polynomial run-time for a parameter which is small in practice. Our algorithm ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2021
ISSN: 1557-8666
DOI: 10.1089/cmb.2020.0606